H. Karatza: Comparative Analysis a Comparative Analysis of Scheduling Policies in a Distributed System Using Simulation
نویسنده
چکیده
In this paper we study scheduling in a distributed system. A simulation model is used to address performance issues associated with scheduling. Three policies which combine processor and I/O scheduling are used to schedule parallel jobs for a variety of workloads. Fairness is required among competing jobs. Simulated results reveal that all scheduling methods have merit, but one method significantly improves the overall performance and also provides a guarantee for fairness in individual job execution.
منابع مشابه
Scheduling Real-Time Jobs in Distributed Systems - Simulation and Performance Analysis
One of the major challenges in ultrascale systems is the effective scheduling of complex jobs within strict timing constraints. The distributed and heterogeneous system resources constitute another critical issue that must be addressed by the employed scheduling strategy. In this paper, we investigate by simulation the performance of various policies for the scheduling of real-time directed acy...
متن کاملA Simulation Model of Task Cluster Scheduling in Distributed Systems
This paper addresses issues of task clustering-the coalition of several fine grain tasks into single coarser grain tasks called task clusters+md task cluster scheduling on distributed processors. The performance of various scheduling schemes is studied and compared f o r a variety of workloads. Simulation results indicate that the scheduling policy that gives priority to the cluster with the ,s...
متن کاملChapter 4 SIMULATION OF PARALLEL AND DISTRIBUTED SYSTEMS SCHEDULING Concepts, Issues and Approaches
This chapter considers the problem of scheduling parallel and distributed computer systems. Several scheduling policies are presented that are employed in these two multiprocessor system types which address different aspects of the scheduling problem. It is shown that simulation is a valuable tool used by many researchers to evaluate the performance of different scheduling methods.
متن کاملPerformance Analysis of Gang Scheduling in a Distributed System under Processor Failures
In this paper we study the performance of a distributed system that is subject to hardware failures and subsequent repairs. A special type of scheduling called gang scheduling is considered, under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. Two different gang scheduling policies used to schedule parallel jobs are examined...
متن کاملScheduling Gangs in a Distributed System
In this paper we study the performance of parallel job scheduling in a distributed system. A special type of scheduling called gang scheduling is considered. In gang scheduling jobs consist of a number of interacting tasks, which are scheduled to run simultaneously on distinct processors. Two gang scheduling policies are used to schedule parallel jobs for two different types of job parallelism....
متن کامل